燃料电池AIP废气处理方案优选模型研究

对潜艇300 kW燃料电池几种可行的气体处理方案进行了对比分析,并运用模糊综合评判方法建立了方案优选模型.研究表明,应用旋转床吸收器吸收废气中的二氧化碳,并配以相应的水处理系统,将二氧化碳排至舷外的方案是最佳方案.     

相继增压柴油机推进装置增压系统特性研究

针对船舶推进装置中柴油主机相继增压特性的优化问题,在理论分析的基础上,建立了基于准稳态假设的增压系统能量平衡模型.对相继增压系统的稳、动态特性进行了分析,讨论了相继增压系统的特性优化问题,为主机采用相继增压技术的柴油机推进装置的性能优化、控制策略的制订提供了理论依据.     

工质变比热和传热损失对Diesel循环性能的影响

用有限时间热力学的方法分析空气标准Diesel循环,由数值计算给出了存在传热损失和工质变比热时循环功与压缩比、效率与压缩比以及功和效率的特性关系,并分析了传热损失和工质变比热对循环性能的影响特点,通过分析可知传热和变比热特性对Diesel循环性能有较大影响,所以在实际循环分析中应该予以考虑.     

高隔离度干涉截止滤光片的设计与制备

根据光通讯无源器件和激光探测仪器对光学薄膜的特殊需求,采用解析法和自动优化法综合设计了高隔离度的干涉截止滤光片,分析了膜厚改变2%对设计膜系的透过率曲线的影响,通过莱宝APS1104镀膜机对所设计的膜系进行了实际镀制,获得了性能优良的高隔离度截止滤光片.     

Subspace dynamic‐simplex linear interpolation search for mixed‐integer black‐box optimization problems

Design and management of complex systems with both integer and continuous decision variables can be guided using mixed‐integer optimization models and analysis. We propose a new mixed‐integer black‐box optimization (MIBO) method, subspace dynamic‐simplex linear interpolation search (SD‐SLIS), for decision making problems in which system performance can only be evaluated with a computer black‐box model. Through a sequence of gradient‐type local searches in subspaces of solution space, SD‐SLIS is particularly efficient for such MIBO problems with scaling issues. We discuss the convergence conditions and properties of SD‐SLIS algorithms for a class of MIBO problems. Under mild conditions, SD‐SLIS is proved to converge to a stationary solution asymptotically. We apply SD‐SLIS to six example problems including two MIBO problems associated with petroleum field development projects. The algorithm performance of SD‐SLIS is compared with that of a state‐of‐the‐art direct‐search method, NOMAD, and that of a full space simplex interpolation search, Full‐SLIS. The numerical results suggest that SD‐SLIS solves the example problems efficiently and outperforms the compared methods for most of the example cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 305–322, 2017     

Optimal maintenance policies for a safety‐critical system and its deteriorating sensor

We consider the integrated problem of optimally maintaining an imperfect, deteriorating sensor and the safety‐critical system it monitors. The sensor's costless observations of the binary state of the system become less informative over time. A costly full inspection may be conducted to perfectly discern the state of the system, after which the system is replaced if it is in the out‐of‐control state. In addition, a full inspection provides the opportunity to replace the sensor. We formulate the problem of adaptively scheduling full inspections and sensor replacements using a partially observable Markov decision process (POMDP) model. The objective is to minimize the total expected discounted costs associated with system operation, full inspection, system replacement, and sensor replacement. We show that the optimal policy has a threshold structure and demonstrate the value of coordinating system and sensor maintenance via numerical examples. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 399–417, 2017     

采用小弹性模量方法的空间飞网构型优化设计

飞网构型设计对提高空间飞网系统的展开抓捕性能具有重要意义。用小弹性模量分析方法对空间飞网构型优化设计问题进行研究。以绳网中内力分布均衡性为优化目标,选取飞网抛射过程中最大受力时刻为研究工况,赋予绳索单元极小弹性模量,进行静力学计算,并以变形后的结果为初始条件进行迭代分析。优化结果表明,绳网中的内力分布随迭代步数的增加而更趋于均匀。在不改变绳网拓扑结构的前提下,所建立的优化设计方法为空间飞网构型优化设计提供了一种参考途径。     

基于族群机制的花朵授粉算法

针对花朵授粉算法易陷入局部极值、收敛速度慢等不足,提出一种具有族群机制的花朵授粉算法。该算法把种群分成多个族群,各族群的最优个体再组成新的种群,进而促进种群间的信息交流,有效地协调种群进化过程中的全局搜索和局部搜索能力,避免个体的早熟收敛,提高算法的全局寻优能力及收敛速度。通过8个CEC2005benchmark测试函数进行测试比较,仿真结果表明,改进算法的寻优性能明显优于基本的花朵授粉算法、粒子群算法和蝙蝠算法,其收敛精度、收敛速度、鲁棒性均较对比算法有较大提高。     

基于广义回归神经网络的单位运营状况分类

单位的运营状况会直接影响股东和广大人民的利益,针对运营状况可以使用广义回归神经网络进行分类。由于广义回归神经网络中径向基函数的扩展参数Spread的选取会导致分类的准确率,提出了一种果蝇优化算法优化参数Spread的分类模型。充分利用了果蝇优化算法的寻优能力,将优化后的参数代入到广义回归神经网络中对单位的财务数据进行运营状况的分类。结果表明,与广义回归神经网络做比较,优化后的网络模型对数据的分类可以达到很高的准确率,在相关领域的分类上有非常大的实用性。     

A logistics scheduling model: Inventory cost reduction by batching

Logistics scheduling refers to the problems where the decisions of job scheduling and transportation are integrated in a single framework. In this paper, we discuss a logistics scheduling model where the raw material is delivered to the shop in batches. By making the batching and scheduling decisions simultaneously, the total inventory and batch setup cost can be reduced. We study different models on this issue, present complexity analysis and optimal algorithms, and conduct computational experiments. Some managerial insights are observed. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.